Some Remarks on the Logic of Gong , Needham
نویسندگان
چکیده
We reveal instances of unsoundness, incompleteness, and redundancy in the cryptographic protocol analysis logic of Gong, Needham and Yahalom. Solutions are proposed for each of these problems. The logic is extended to formalize the use of an uncertiied key in the Yahalom protocol, and our analysis of the protocol suggests the possibility of a redundancy in the protocol.
منابع مشابه
On the Automation of Gny Logic
The cryptographic protocol analysis logic of Gong, Needham and Yahalom (GNY) ooers signiicant advantages over its predecessor, the Burrows, Abadi and Needham (BAN) logic. Manual analysis of protocols using the GNY logic, however, is cumbersome , as the logic has a large set of inference rules. This paper proposes a modiied GNY logic, and describes the implementation of a protocol analysis tool ...
متن کاملHandling Infeasible Speciications of Cryptographic Protocols
In the veriication of cryptographic protocols along the approach of the logic for authentication by Burrows, Abadi, and Needham, it is possible to write a speciica-tion which does not faithfully represent the real world situation. Such a speciication, though impossible or unreasonable to implement, can go undetected and be veriied to be correct. It can also lead to logical statements that do no...
متن کاملTransport Level Security: a proof using the Gong-Needham-Yahalom Logic
This paper provides a proof of the proposed Internet standard Transport Level Security protocol using the Gong{Needham{Yahalom logic. It is intended as a teaching aid and hopes to show to students: the potency of a formal method for protocol design; some of the subtleties of authenticating parties on a network where all messages can be intercepted; the design of what should be a widely accepted...
متن کاملAn augmentation of BAN-like logics
We address a common problem of a series of logics for analysis of authentication protocols due to Burrows-Abadi-Needham (BAN), Gong-Needham-Yahalom (GNY), Abadi-Tuttle (AT) and Syverson-Van Oorschot (SVO). The problem can be referred to as that these logics lack a computationally accountable means to perform an important protocol analysis step, called protocol idealization which is to transform...
متن کاملSOME REMARKS ON WEAKLY INVERTIBLE FUNCTIONS IN THE UNIT BALL AND POLYDISK
We will present an approach to deal with a problem of existence of (not) weakly invertible functions in various spaces of analytic functions in the unit ball and polydisk based on estimates for integral operators acting between functional classes of different dimensions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994